On the distribution of computation for sequential decoding using the stack algorithm
نویسنده
چکیده
منابع مشابه
A stack-based chaotic algorithm for encryption of colored images
In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...
متن کاملSequential decoding for lossless streaming source coding with side information
The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...
متن کاملConvolutional source encoding
[l] J. M. Wozencraft , “Sequential decoding for reliable communication,” SC. D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge, June 1957. [2] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically opt imum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967. [3] R. G. Gallager, Information Theory and Reliable Communicat ion. New York: W ile...
متن کاملSequential stack decoding of binary Reed-Muller codes
Norbert Stolte, Ulrich Sorger, Gunther Sessler Institute of Network and Signal Theory Darmstadt University of Technology (TUD) e-mail: [email protected] Abstract | In this paper we propose a sequential stack algorithm to decode binary Reed-Muller codes which is based on the GC structure of these codes. A key problem of sequential decoding is the estimation of errors in the unexplored ...
متن کاملSequential decoding of convolutional codes by a compressed multiple queue algorithm - Communications, IEE Proceedings-
The conventional multiple stack algorithm (MSA) is an efficient approach for solving erasure problems in sequential decoding. However, the requirements of multiple stacks and large memory make its implementation difficult. Furthermore, the MSA allows only one stack to be in use at a time: the other stacks will stay idle until the process in that stack is terminated. Thus it seems difficult to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 25 شماره
صفحات -
تاریخ انتشار 1979